Using analog computers in today's largest computational challenges
نویسندگان
چکیده
Analog computers can be revived as a feasible technology platform for low precision, energy efficient and fast computing. We justify this statement by measuring the performance of modern analog computer comparing it with that traditional digital processors. General statements are made about solution ordinary partial differential equations. Computational fluid dynamics discussed an example large scale scientific computing applications. Several models proposed which demonstrate benefits digital-analog hybrid
منابع مشابه
Grounding Analog Computers
1.0 Is Cognition Discrete or Continuous? 1.1 Although I hate to haggle over words, Harnad's use ofànalog' confuses a number of issues. The problem begins with the phrasèanalog world' in the title, which does not correspond to any technical or nontechnical usage ofànalog' with which I'm familiar. Although I don't know precisely what he means byànalog', it is clearly related to the distinction be...
متن کاملBrains as analog-model computers
Computational neuroscientists not only employ computer models and simulations in studying brain functions. They also view the modeled nervous system itself as computing. What does it mean to say that the brain computes? And what is the utility of the ‘brain-as-computer’ assumption in studying brain functions? In previous work, I have argued that a structural conception of computation is not ade...
متن کاملDenial of Service Attack Detection using Extended Analog Computers
Denial of Service (DoS) attacks, a damaging assault on computer networking infrastructure, have been extensively examined by the digital computing community. However, no work has been done to examine the ability of Extended Analog Computers (EAC) to detect DoS attacks. In this paper, we discuss how EACs could be used in DoS detection.
متن کاملIteration, Inequalities, and Differentiability in Analog Computers
Shannon's General Purpose Analog Computer (GPAC) is an elegant model of analog computation in continuous time. In this paper, we consider whether the set G of GPAC-computable functions is closed under iteration, that is, whether for any function f(x) 2 G there is a function F (x; t) 2 G such that F (x; t) = f (x) for non-negative integers t. We show that G is not closed under iteration, but a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Radio Science
سال: 2021
ISSN: ['1684-9965', '1684-9973']
DOI: https://doi.org/10.5194/ars-19-105-2021